Gossip Márk Jelasity
نویسنده
چکیده
Gossip plays a very significant role in human society. Information spreads throughout the human grapevine at an amazing speed, often reaching almost everyone in a community, without any central coordinator. Moreover, rumor tends to be extremely stubborn: once spread, it is nearly impossible to erase it. In many distributed computer systems—most notably in cloud computing and peer-to-peer computing—this speed and robustness, combined with algorithmic simplicity and the lack of central management, are very attractive features. Accordingly, over the past few decades several gossip-based algorithms have been developed to solve various problems. In this chapter, we focus on two main manifestations of gossip: information spreading (also known as multicast) where a piece of news is being spread, and information aggregation (or distributed data mining), where distributed information is being summarized. For both topics we discuss theoretical issues, mostly relying on results from epidemiology, and we also consider design issues and optimizations in distributed applications.
منابع مشابه
A comparative study of spanning tree and gossip protocols for aggregation
Cím: A comparative study of spanning tree and gossip protocols for aggregation
متن کاملEngineering Emergence through Gossip
Gossip is one of the most usual social activities. The result of gossip is that new and interesting information spreads over a social network not unlike diseases during an epidemic, or computer worms over the Internet. We will argue here that the core “idea” of gossip, that is, periodic information exchange among members of a group over a network that connects them, and a subsequent update of t...
متن کاملAsynchronous Distributed Power Iteration with Gossip-Based Normalization
The dominant eigenvector of matrices defined by weighted links in overlay networks plays an important role in many peer-to-peer applications. Examples include trust management, importance ranking to support search, and virtual coordinate systems to facilitate managing network proximity. Robust and efficient asynchronous distributed algorithms are known only for the case when the dominant eigenv...
متن کاملA Robust and Scalable Peer-to-Peer Gossiping Protocol
The newscast model is a general approach for communication in large agent-based distributed systems. The two basic services— membership management and information dissemination—are implemented by the same epidemic-style protocol. In this paper we present the newscast model and report on experiments using a Java implementation. The experiments involve communication in a large, wide-area cluster ...
متن کاملSpanning Tree or Gossip for Aggregation: A Comparative Study
Distributed aggregation queries like average and sum can be implemented in several different paradigms including gossip and hierarchical approaches. In the literature, these two paradigms are routinely associated with stereotypes such as “trees are fragile and complicated” and “gossip is slow and expensive”. However, a closer look reveals that these statements are not backed up by thorough stud...
متن کامل